0.04/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.09 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.08/0.29 % Computer : n024.cluster.edu 0.08/0.29 % Model : x86_64 x86_64 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.29 % Memory : 8042.1875MB 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.29 % CPULimit : 1920 0.08/0.29 % WCLimit : 240 0.08/0.29 % DateTime : Wed Jul 30 03:47:34 EDT 2025 0.08/0.29 % CPUTime : 0.14/0.39 Running higher-order theorem proving 0.14/0.40 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.PsdiF8Ix1o/E---3.1_21301.p 0.14/0.41 # Version: 3.0.0-ho 0.14/0.41 # Preprocessing class: HSSSSMSSMLSNHSN. 0.14/0.41 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.41 # Starting new_ho_9 with 1200s (5) cores 0.14/0.41 # Starting post_as_ho1 with 240s (1) cores 0.14/0.41 # Starting sh1l with 240s (1) cores 0.14/0.41 # Starting post_as_ho10 with 240s (1) cores 0.14/0.41 # post_as_ho1 with pid 21380 completed with status 0 0.14/0.41 # Result found by post_as_ho1 0.14/0.41 # Preprocessing class: HSSSSMSSMLSNHSN. 0.14/0.41 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.41 # Starting new_ho_9 with 1200s (5) cores 0.14/0.41 # Starting post_as_ho1 with 240s (1) cores 0.14/0.41 # No SInE strategy applied 0.14/0.41 # Search class: HGHNF-FFSF00-SHSSMFNN 0.14/0.41 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.14/0.41 # Starting new_ho_10 with 130s (1) cores 0.14/0.41 # new_ho_10 with pid 21383 completed with status 0 0.14/0.41 # Result found by new_ho_10 0.14/0.41 # Preprocessing class: HSSSSMSSMLSNHSN. 0.14/0.41 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.41 # Starting new_ho_9 with 1200s (5) cores 0.14/0.41 # Starting post_as_ho1 with 240s (1) cores 0.14/0.41 # No SInE strategy applied 0.14/0.41 # Search class: HGHNF-FFSF00-SHSSMFNN 0.14/0.41 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.14/0.41 # Starting new_ho_10 with 130s (1) cores 0.14/0.41 # Preprocessing time : 0.001 s 0.14/0.41 # Presaturation interreduction done 0.14/0.41 0.14/0.41 # Proof found! 0.14/0.41 # SZS status Theorem 0.14/0.41 # SZS output start CNFRefutation 0.14/0.41 thf(decl_28, type, union: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.41 thf(decl_30, type, intersection: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.41 thf(decl_31, type, setminus: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.41 thf(decl_37, type, epred1_0: $i > $o). 0.14/0.41 thf(decl_38, type, epred2_0: $i > $o). 0.14/0.41 thf(decl_39, type, epred3_0: $i > $o). 0.14/0.41 thf(decl_40, type, esk1_0: $i). 0.14/0.41 thf(union, axiom, ((union)=(^[X5:$i > $o, X6:$i > $o, X4:$i]:(((X5 @ X4)|(X6 @ X4))))), file('/export/starexec/sandbox/tmp/tmp.PsdiF8Ix1o/E---3.1_21301.p', union)). 0.14/0.41 thf(intersection, axiom, ((intersection)=(^[X9:$i > $o, X10:$i > $o, X4:$i]:(((X9 @ X4)&(X10 @ X4))))), file('/export/starexec/sandbox/tmp/tmp.PsdiF8Ix1o/E---3.1_21301.p', intersection)). 0.14/0.41 thf(setminus, axiom, ((setminus)=(^[X11:$i > $o, X12:$i > $o, X4:$i]:(((X11 @ X4)&~((X12 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.PsdiF8Ix1o/E---3.1_21301.p', setminus)). 0.14/0.41 thf(thm, conjecture, ![X22:$i > $o, X23:$i > $o, X24:$i > $o]:(((setminus @ X22 @ (union @ X23 @ X24))=(intersection @ (setminus @ X22 @ X23) @ (setminus @ X22 @ X24)))), file('/export/starexec/sandbox/tmp/tmp.PsdiF8Ix1o/E---3.1_21301.p', thm)). 0.14/0.41 thf(c_0_4, plain, ((union)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[union])). 0.14/0.41 thf(c_0_5, plain, ((intersection)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[intersection])). 0.14/0.41 thf(c_0_6, plain, ((setminus)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)&~((Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[setminus])). 0.14/0.41 thf(c_0_7, negated_conjecture, ~(![X22:$i > $o, X23:$i > $o, X24:$i > $o, X28:$i]:((((X22 @ X28)&~(((X23 @ X28)|(X24 @ X28))))<=>(((X22 @ X28)&~((X23 @ X28)))&((X22 @ X28)&~((X24 @ X28))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_4]), c_0_5]), c_0_6])])). 0.14/0.41 thf(c_0_8, negated_conjecture, ((~(epred1_0 @ esk1_0)|((epred2_0 @ esk1_0)|(epred3_0 @ esk1_0))|(~(epred1_0 @ esk1_0)|(epred2_0 @ esk1_0)|(~(epred1_0 @ esk1_0)|(epred3_0 @ esk1_0))))&(((((epred1_0 @ esk1_0)|(epred1_0 @ esk1_0))&(~(epred2_0 @ esk1_0)|(epred1_0 @ esk1_0)))&(((epred1_0 @ esk1_0)|(epred1_0 @ esk1_0))&(~(epred3_0 @ esk1_0)|(epred1_0 @ esk1_0))))&(((((epred1_0 @ esk1_0)|~(epred2_0 @ esk1_0))&(~(epred2_0 @ esk1_0)|~(epred2_0 @ esk1_0)))&(((epred1_0 @ esk1_0)|~(epred2_0 @ esk1_0))&(~(epred3_0 @ esk1_0)|~(epred2_0 @ esk1_0))))&((((epred1_0 @ esk1_0)|~(epred3_0 @ esk1_0))&(~(epred2_0 @ esk1_0)|~(epred3_0 @ esk1_0)))&(((epred1_0 @ esk1_0)|~(epred3_0 @ esk1_0))&(~(epred3_0 @ esk1_0)|~(epred3_0 @ esk1_0))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])). 0.14/0.41 thf(c_0_9, negated_conjecture, ((epred2_0 @ esk1_0)|(epred3_0 @ esk1_0)|(epred2_0 @ esk1_0)|(epred3_0 @ esk1_0)|~((epred1_0 @ esk1_0))|~((epred1_0 @ esk1_0))|~((epred1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.14/0.41 thf(c_0_10, negated_conjecture, ((epred1_0 @ esk1_0)|(epred1_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.14/0.41 thf(c_0_11, negated_conjecture, (~((epred2_0 @ esk1_0))|~((epred2_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.14/0.41 thf(c_0_12, negated_conjecture, (~((epred3_0 @ esk1_0))|~((epred3_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.14/0.41 thf(c_0_13, negated_conjecture, ((epred2_0 @ esk1_0)|(epred3_0 @ esk1_0)|~((epred1_0 @ esk1_0))), inference(cn,[status(thm)],[c_0_9])). 0.14/0.41 thf(c_0_14, negated_conjecture, (epred1_0 @ esk1_0), inference(cn,[status(thm)],[c_0_10])). 0.14/0.41 thf(c_0_15, negated_conjecture, ~((epred2_0 @ esk1_0)), inference(cn,[status(thm)],[c_0_11])). 0.14/0.41 thf(c_0_16, negated_conjecture, ~((epred3_0 @ esk1_0)), inference(cn,[status(thm)],[c_0_12])). 0.14/0.41 thf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])]), c_0_15]), c_0_16]), ['proof']). 0.14/0.41 # SZS output end CNFRefutation 0.14/0.41 # Parsed axioms : 29 0.14/0.41 # Removed by relevancy pruning/SinE : 0 0.14/0.41 # Initial clauses : 27 0.14/0.41 # Removed in clause preprocessing : 14 0.14/0.41 # Initial clauses in saturation : 13 0.14/0.41 # Processed clauses : 13 0.14/0.41 # ...of these trivial : 7 0.14/0.41 # ...subsumed : 2 0.14/0.41 # ...remaining for further processing : 3 0.14/0.41 # Other redundant clauses eliminated : 0 0.14/0.41 # Clauses deleted for lack of memory : 0 0.14/0.41 # Backward-subsumed : 0 0.14/0.41 # Backward-rewritten : 0 0.14/0.41 # Generated clauses : 0 0.14/0.41 # ...of the previous two non-redundant : 0 0.14/0.41 # ...aggressively subsumed : 0 0.14/0.41 # Contextual simplify-reflections : 0 0.14/0.41 # Paramodulations : 0 0.14/0.41 # Factorizations : 0 0.14/0.41 # NegExts : 0 0.14/0.41 # Equation resolutions : 0 0.14/0.41 # Disequality decompositions : 0 0.14/0.41 # Total rewrite steps : 8 0.14/0.41 # ...of those cached : 7 0.14/0.41 # Propositional unsat checks : 0 0.14/0.41 # Propositional check models : 0 0.14/0.41 # Propositional check unsatisfiable : 0 0.14/0.41 # Propositional clauses : 0 0.14/0.41 # Propositional clauses after purity: 0 0.14/0.41 # Propositional unsat core size : 0 0.14/0.41 # Propositional preprocessing time : 0.000 0.14/0.41 # Propositional encoding time : 0.000 0.14/0.41 # Propositional solver time : 0.000 0.14/0.41 # Success case prop preproc time : 0.000 0.14/0.41 # Success case prop encoding time : 0.000 0.14/0.41 # Success case prop solver time : 0.000 0.14/0.41 # Current number of processed clauses : 3 0.14/0.41 # Positive orientable unit clauses : 1 0.14/0.41 # Positive unorientable unit clauses: 0 0.14/0.41 # Negative unit clauses : 2 0.14/0.41 # Non-unit-clauses : 0 0.14/0.41 # Current number of unprocessed clauses: 0 0.14/0.41 # ...number of literals in the above : 0 0.14/0.41 # Current number of archived formulas : 0 0.14/0.41 # Current number of archived clauses : 0 0.14/0.41 # Clause-clause subsumption calls (NU) : 0 0.14/0.41 # Rec. Clause-clause subsumption calls : 0 0.14/0.41 # Non-unit clause-clause subsumptions : 0 0.14/0.41 # Unit Clause-clause subsumption calls : 0 0.14/0.41 # Rewrite failures with RHS unbound : 0 0.14/0.41 # BW rewrite match attempts : 0 0.14/0.41 # BW rewrite match successes : 0 0.14/0.41 # Condensation attempts : 13 0.14/0.41 # Condensation successes : 0 0.14/0.41 # Termbank termtop insertions : 1309 0.14/0.41 # Search garbage collected termcells : 241 0.14/0.41 0.14/0.41 # ------------------------------------------------- 0.14/0.41 # User time : 0.003 s 0.14/0.41 # System time : 0.001 s 0.14/0.41 # Total time : 0.004 s 0.14/0.41 # Maximum resident set size: 1772 pages 0.14/0.41 0.14/0.41 # ------------------------------------------------- 0.14/0.41 # User time : 0.006 s 0.14/0.41 # System time : 0.001 s 0.14/0.41 # Total time : 0.007 s 0.14/0.41 # Maximum resident set size: 1772 pages 0.14/0.41 % E exiting 0.14/0.41 % E exiting 0.14/0.41 EOF